Exponential time hypothesis

Results: 28



#Item
11Game theory / Computational complexity theory / Quantum complexity theory / Complexity classes / Decision theory / Nash equilibrium / Price of anarchy / Exponential time hypothesis / Circuit complexity / Communication complexity / Algorithmic game theory / PP

CS369E: Communication Complexity (for Algorithm Designers) Lecture #7: Lower Bounds in Algorithmic Game Theory∗ Tim Roughgarden† March 5, 2015

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2015-09-14 17:18:05
12Constraint programming / Numerical software / Automated theorem proving / DPLL algorithm / Packing problems / Solver / Constraint satisfaction / Reduction / Algorithm / Exponential time hypothesis / Bin packing problem

A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Takehide Soh1 , Katsumi Inoue12 , Naoyuki Tamura3 , Mutsunori Banbara3 , and Hidetomo Nabeshima4 1

Add to Reading List

Source URL: tmancini.di.uniroma1.it

Language: English - Date: 2008-12-16 11:07:40
13Complexity classes / Computational complexity theory / Boolean algebra / Structural complexity theory / NP-complete problems / Boolean satisfiability problem / NP / PP / Reduction / True quantified Boolean formula / Exponential time hypothesis / P

Economics and Computation ECONand CPSCProfessor Dirk Bergemann and Professor Joan Feigenbaum Lecture IV

Add to Reading List

Source URL: zoo.cs.yale.edu

Language: English - Date: 2008-10-07 04:07:53
14Dynamic programming / Dynamic time warping / Longest common subsequence problem / Levenshtein distance / Metric space / Exponential time hypothesis / NC

Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping Karl Bringmann∗ Marvin Künnemann†

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:47:08
15Computational complexity theory / Theory of computation / Exponential time hypothesis / Time complexity / NC / Gadget

Why walking the dog takes time: Fr´echet distance has no strongly subquadratic algorithms unless SETH fails Karl Bringmann∗ April 10, 2014 Abstract

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:46:32
16Theoretical computer science / Computational complexity theory / Mathematics / Automated theorem proving / Logic in computer science / Rules of inference / Resolution / Proof complexity / Conflict-Driven Clause Learning / Boolean algebra / Exponential time hypothesis / PP

On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity [Extended Abstract] Trinh Huynh

Add to Reading List

Source URL: www.complexity.ethz.ch

Language: English - Date: 2012-03-28 07:53:42
17Mathematics / Computational complexity theory / Mathematical analysis / Machine learning / Multi-armed bandit / Stochastic optimization / Algorithm / Exponential time hypothesis / Big O notation

Almost Optimal Exploration in Multi-Armed Bandits Zohar Karnin Yahoo! Labs, Haifa, Israel Tomer Koren† Technion—Israel Institute of Technology, Haifa, Israel

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2013-08-14 01:36:43
18NP-complete problems / Analysis of algorithms / Complexity classes / Parameterized complexity / Kernelization / Bidimensionality / Dominating set / Exponential time hypothesis / Feedback vertex set / Theoretical computer science / Computational complexity theory / Applied mathematics

The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-10-06 03:04:07
19NP-complete problems / Logic in computer science / Exponential time hypothesis / 2-satisfiability / Boolean satisfiability problem / Conjunctive normal form / Time complexity / Parameterized complexity / Dominating set / Theoretical computer science / Computational complexity theory / Applied mathematics

On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams†

Add to Reading List

Source URL: www.stanford.edu

Language: English - Date: 2009-11-12 23:47:30
20NP-complete problems / Parameterized complexity / Exponential time hypothesis / Dominating set / Tree decomposition / Vertex cover / Graph coloring / Equitable coloring / Clique / Theoretical computer science / Graph theory / Mathematics

Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology Michael Fellows University of Newcastle, Callaghan, Australia

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-10-06 02:49:42
UPDATE